Edgeworth Expansions for Centered Random Walks on Covering Graphs of Polynomial Volume Growth

نویسندگان

چکیده

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends not only geometric features the underlying but also modified harmonic embedding graph into certain nilpotent Lie group. Moreover, we apply rate convergence Trotter's approximation theorem to establish Berry-Esseen type bound walks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffusive estimates for random walks on stationary random graphs of polynomial growth

Let (G, ρ) be a stationary random graph, and use Bρ (r) to denote the ball of radius r about ρ in G. Suppose that (G, ρ) has annealed polynomial growth, in the sense that E[|Bρ (r)|] 6 O(rk) for some k > 0 and every r > 1. Then there is an infinite sequence of times {tn} at which the random walk {Xt} on (G, ρ) is at most diffusive: Almost surely (over the choice of (G, ρ)), there is a number C ...

متن کامل

Random Walks on Random Graphs

The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...

متن کامل

Random walks under slowly varying moment conditions on groups of polynomial volume growth

Let G be a finitely generated group of polynomial volume growth equipped with a word-length | · |. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures μ such that, for any ǫ > 0, ∑ | · |ǫμ = ∞. In particular, we provide a sharp lower bound for the return probability in the case when μ has a finite weak-logarithmic moment.

متن کامل

Random walks on random graphs

Random walks on random graphs – p. 1/2

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Theoretical Probability

سال: 2021

ISSN: ['1572-9230', '0894-9840']

DOI: https://doi.org/10.1007/s10959-021-01111-7